Around Efimov’s differential test for homeomorphism
نویسندگان
چکیده
منابع مشابه
A Homeomorphism Invariant for Substitution
We derive a homeomorphism invariant for those tiling spaces which are made by rather general substitution rules on polygonal tiles, including those tilings, like the pinwheel, which contain tiles in infinitely many orientations. The invariant is a quotient of Čech cohomology, is easily computed directly from the substitution rule, and distinguishes many examples, including most pinwheel-like ti...
متن کاملHomeomorphism between [:e
The notation and terminology used in this paper have been introduced in the following articles: [20], [9], [25], [7], [8], [4], [16], [24], [21], [19], [13], [18], [23], [1], [2], [10], [5], [17], [11], [3], [22], [14], [12], [6], [26], and [15]. We use the following convention: i, j, n denote natural numbers, f , g, h, k denote finite sequences of elements of R, and M , N denote non empty metr...
متن کاملContinuity and Homeomorphism Groups
Proof. There exists an open neighborhood W of xgcb such that clsWCZ U, where els W denotes the closure of W. Let [ATjfc|fe = l, 2, • • • ] be a neighborhood base at ~1 which is closed. Moreover WEW, i.e. 4>UxEW. Thus there exists k such that ATJItCWCcls W. Hence xECk. Now from WlCU...
متن کاملThe Homeomorphism Problem for Countable Topological Spaces
We consider the homeomorphism problem for countable topological spaces and investigate its descriptive complexity as an equivalence relation. It is shown that even for countable metric spaces the homeomorphism problem is strictly more complicated than the isomorphism problem for countable graphs and indeed it is not Borel reducible to any orbit equivalence relation induced by a Borel action of ...
متن کاملEfficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
سال: 2020
ISSN: 0138-4821,2191-0383
DOI: 10.1007/s13366-020-00534-3